Equivalences on program schemes
نویسندگان
چکیده
منابع مشابه
Equivalences on Program Schemes
General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edin...
متن کاملEquivalences of Derived Categories of Sheaves on Quasi-projective Schemes
We extend Orlov’s result on representability of equivalences to schemes projective over a field. We also investigate the quasi-projective case.
متن کاملEquivalences and Transformations Systems-applications to Recursive Program Schemes and Grammars* of Regular
This work presents a unified theory of recursive program schemes, context-free grammars, grammars on arbitrary algebraic structures and, in fact, recursive definitions of all kind by means of regular systems. The equivalences of regular systems associated with either all their solutions or their least solutions (in all domains of appropriate type satisfying a set of algebraic laws expressed by ...
متن کاملOn Monoidal Equivalences and Ann-equivalences
The equivalence between a monoidal category and a strict one has been proved by some authors such as Nguyen Duy Thuan [8], Christian Kassel [2], Peter Schauenburg [7]. In this paper, we show another proof of the problem by constructing a strict monoidal category M(C) consisting of M -functors and M morphisms of a category C and we prove C is equivalent to it. The proof is based on a basic chara...
متن کاملOn Higher Order Recursive Program Schemes
We deene Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the-calculus) in right-hand sides of function and quantiier deenitions. A study of several kinds of similarity of redexes makes it possible to lift properties of ((rst order) Recursive Program Schemes to the higher order case. The main result is the decidability of weak normalization in HRPSs, which imm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1970
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(70)80021-6